Relational Consistencies
نویسنده
چکیده
We perform an extensive comparison of relational consistencies along four dimensions: on binary constraints, on non-binary constraints, on encodings of non-binary constraints, and on decomposable non-binary constraints. Our results contain some surprises. For example, on binary constraints, relational path-consistency does not reduce to path-consistency. On non-binary constraints, relational arc-consistency is incomparable to generalized arc-consistency, whilst strong relational arcconsistency dominates generalized arc-consistency. We also present results on inverse, interval and conjunctive consistency.
منابع مشابه
Cohérences basées sur les valeurs en échec
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations or nogoods. Two main families of consistencies have been introduced so far : those that permit to reason from variables such as (i, j)-consistency and those that permit to reason from constraints such as relational (i, j)...
متن کاملInverse Consistencies for Non-Binary Constraints
We present a detailed study of two inverse consistencies for non-binary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose algorithms to achieve rel PIC and PWIC, that have a time complexity better than the previous generic algori...
متن کاملFailed Value Consistencies for Constraint Satisfaction
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (also called nogoods). Two main families of consistencies have been introduced so far: those that permit us to reason from variables such as (i, j)-consistency and those that permit us to reason from constraints such as r...
متن کاملWeight-Based Variable Ordering in the Context of High-Level Consistencies
Dom/wdeg is one of the best performing heuristics for dynamic variable ordering in backtrack search [Boussemart et al., 2004]. As originally defined, this heuristic increments the weight of the constraint that causes a domain wipeout (i.e., a dead-end) when enforcing arc consistency during search. “The process of weighting constraints with dom/wdeg is not defined when more than one constraint l...
متن کاملLocal Consistencies in SAT
We introduce some new mappings of constraint satisfaction problems into propositional satisfiability. These encodings generalize most of the existing encodings. Unit propagation on those encodings is the same as establishing relational k-arc consistency on the original problem. They can also be used to establish (i,j)-consistency on binary constraints. Experiments show that these encodings are ...
متن کامل